Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
نویسندگان
چکیده
منابع مشابه
Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems
Minton, S., M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 161-205. The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variab...
متن کاملMinimizing Con icts A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems
This paper describes a simple heuristic approach to solving large scale constraint satisfaction and scheduling problems In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs The search can be guided by a value ordering heuristic the min con icts heuristic that attempts to minimize the number of constraint violations...
متن کاملAn Extended Abstract: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems
One of the most promising general approaches for solving combinatorial search problems is to generate an initial, suboptimal solution and then to apply local repair heuristics. Techniques based on this approach have met with empirical success on many combinatorial problems, including the traveling salesman and graph partitioning problems[10]. Such techniques also have a long tradition in AI, mo...
متن کاملMinimizing Conflicts : A Heuristic Repair
This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-connicts heuristic, that attempts to minimize the number of constraint violat...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1992
ISSN: 0004-3702
DOI: 10.1016/0004-3702(92)90007-k